Fast Directional Spatially Localized Spherical Harmonic Transform
نویسندگان
چکیده
منابع مشابه
Spherical Harmonic Transform Algorithms
A collection of MATLAB classes for computing and using spherical harmonic transforms is presented. Methods of these classes compute differential operators on the sphere and are used to solve simple partial differential equations in a spherical geometry. The spectral synthesis and analysis algorithms using fast Fourier transforms and Legendre transforms with the associated Legendre functions are...
متن کاملSpherical Harmonic Transform with GPUs
We describe an algorithm for computing an inverse spherical harmonic transform suitable for graphic processing units (GPU). We use CUDA and base our implementation on a Fortran90 routine included in a publicly available parallel package, shat. We focus our attention on the two major sequential steps involved in the transforms computation, retaining the efficient parallel framework of the origin...
متن کاملFast Spherical Harmonic Transform Algorithm based on Generalized Fast Multipole Method
Spherical harmonic transform is the most important orthogonal function transform only except Fourier transform, and is used not only for climate simulation and signal processing but also for a base of several numerical algorithms. Fast Fourier Transform (FFT), which runs in time O(N logN) is quite well known, but, for spherical harmonic transform, there is no fast algorithm which is as simple a...
متن کاملLocalized waves with spherical harmonic symmetries
M. S. Mills,1,* G. A. Siviloglou,2 N. Efremidis,3 T. Graf,4 E. M. Wright,4 J. V. Moloney,4 and D. N. Christodoulides1 1CREOL School of Optics, University of Central Florida, Orlando, Florida 32816, USA 2MIT-Harvard Center for Ultracold Atoms, Research Laboratory of Electronics, and Department of Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA 3Department of A...
متن کاملOptimization of Spherical Harmonic Transform Computations
Spherical Harmonic Transforms (SHTs) which are essentially Fourier transforms on the sphere are critical in global geopotential and related applications. Discrete SHTs are more complex to optimize computationally than Fourier transforms in the sense of the well-known Fast Fourier Transforms (FFTs). Furthermore, for analysis purposes, discrete SHTs are difficult to formulate for an optimal discr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2013
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2013.2247601